//
// Created by liushuai on 2020/5/6.
//

#ifndef DBFS_TREEOPERATOR_H
#define DBFS_TREEOPERATOR_H

#include "TreeNode.h"
#include <climits>
#include <vector>
bool isSymmetric(TreeNode* root1,TreeNode* root2);
bool isSymmetric(TreeNode* root);
bool isValidBST(TreeNode* root);
bool isValidBST(TreeNode* root,long min,long max);
TreeNode* sortedArrayToBST(std::vector<int>& nums);
TreeNode* sortedArrayToBST(std::vector<int>& nums,int l,int r);
#endif //DBFS_TREEOPERATOR_H
